Quality-complexity trade-off in predictive LSF quantization

In this paper several techniques are investigated for reduction of complexity and/or improving quality of a line spectrum frequencies (LSF) quantization based on switched prediction (SP) and vector quantization (VQ). For switched prediction, a higher number of prediction matrices is proposed. Quality of the quantized speech is improved by the prediction multi-candidate and delayed decision algorithm. It is shown that quantizers with delayed decision can save up to one bit still having similar or even lower complexity than the baseline quantizers with 2 switched matrices. By efficient implementation of prediction, lower complexity can be achieved through use of prediction matrices with reduced number of non-zero elements. By combining such sparse matrices and multiple prediction candidates, the best qualitycomplexity compromise quantizers can be obtained as demonstrated by experimental results.